WLP 2014 28 th Workshop on ( Constraint ) Logic Programming

نویسندگان

  • Martin Baláž
  • Jozef Frtús
  • Martin Homola
  • Ján Šefránek
  • Giorgos Flouris
  • Michael Hanus
  • Markus Lepper
  • Nikita Danilenko
  • Janis Voigtländer
چکیده

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strategy (CRS), in order to achieve an extended flexibility and generality. Our argumentation semantics is defined in the frame of assumption-based framework (ABF), which enables a unified view on different non-monotonic formalisms. We present an embedding of DeLP into an instance of ABF. Consequently, argumentation semantics defined for ABF are applicable to DeLP. Finally, DeLP with CRS is embedded into GLP. This transformation enables to commute argumentation semantics of a DeLP via semantics of the corresponding GLP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wlp 2008

Die Gesellschaft für Logische Programmierung e.V. [1], die deutschsprachige Abteilung (für Deutschland, Österreich und die Schweiz) der Association of Logic Programming [2], organisiert seit vielen Jahren den Workshop on (Constraint) Logic Programming (WLP). Auf dem alljährlich stattfindenden WLP treffen sich Wissenschaftler aus den Gebieten der logischen Programmierung, der Constraint-Programm...

متن کامل

Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation

on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming (WLP’15/’16/WFLP’16). EPTCS 234, 2017, pp. 57–72, doi:10.4204/EPTCS.234.5 c © S. Brass & H. Stephan This work is licensed under the Creative Commons Attribution-Noncommercial-No Derivative Works License. Experiences with Some Benchmarks for Deductive Databases and Implementations o...

متن کامل

Curry without Success

Curry is a successful, general-purpose, functional logic programming language that predefines a singleton type Success explicitly to support its logic component. We take the likely-controversial position that without Success Curry would be as much logic or more. We draw a short history and motivation for the existence of this type and justify why its elimination could be advantageous. Furthermo...

متن کامل

Implementing GraphQL as a Query Language for Deductive Databases in SWI-Prolog Using DCGs, Quasi Quotations, and Dicts

on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming (WLP’15/’16/WFLP’16). EPTCS 234, 2017, pp. 42–56, doi:10.4204/EPTCS.234.4 c © F. Nogatz & D. Seipel This work is licensed under the Creative Commons Attribution License. Implementing GraphQL as a Query Language for Deductive Databases in SWI–Prolog Using DCGs, Quasi Quotations, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015